Sigma-delta-d/a-converter

ABSTRACT

The present invention is directed to a sigma-delta D-A converter ( 300 ) with N stages, in which the nth stage, where n=1, 2, 3 . . . N, comprises a first adder ( 10 ) which adds a use signal x(k) ( 12 ) with an error signal err n (k−1) to an input signal e n (k) ( 14 ), a quantizer ( 16 ) which quantizes the input signal e n (k) ( 14 ) to an output signal y n (k) ( 18 ) according to a predetermined quantization function, and a second adder ( 20 ) which adds the input signal e n (k) ( 14 ) with the inverted output signal y n (k) to x n (k) ( 21 ), and supplies it to a delay device ( 22 ) which sends the signal x n (k) ( 21 ) to the first adder ( 10 ) as an error signal err n (k−1) with a delay by a clock period. For this purpose, an amount reducer ( 24 ) is provided between the second adder ( 20 ) and the delay device ( 22 ), which amount reducer ( 24 ) leaves the signal x n (k) ( 21 ) unchanged when x n (k)=0 and otherwise lowers the amount |x n (k)| of the signal x n (k) ( 21 ) by at least a smallest representable numerical unit, wherein the quantization function of the quantizer ( 16 ) of the nth stage of the sigma-delta D-A converter ( 300 ) is expressed as follows:            y   n          (   k   )       =     {             2     (     1   -   n     )       ,             if                     e   n          (   k   )         &gt;     2     -   n                   0   ,             if                 abs                   (       e   n          (   k   )       )       ≤     2     -   n                     -     2     (     1   -   n     )         ,             if                     e   n          (   k   )         &lt;     -       2     -   n       .

TECHNICAL FIELD

The invention is directed to a sigma-delta D-A converter with N stages, in which the nth stage, where n=1, 2, 3 . . . N, comprises a first adder which adds a use signal or use signals x(k) with an error signal err_(n)(k- 1) to an input signal e_(n)(k), a quantizer which quantizes the input signal e_(n)(k) to an output signal y_(n)(k) according to a predetermined quantization function, and a second adder which adds the input signal e_(n)(k) with the inverted output signal y_(n)(k) to x_(n)(k), and supplies it to a delay device which sends the signal xn(k) to the first adder as an error signal err_(n)(k−1) with a delay by a clock period according to the preamble of claim 1.

PRIOR ART

A sigma-delta D-A converter of the generic type is known from the book “Delta Sigma Data Converter, Theory, Design and Simulation”, by Steven R. Norsworthy, Richard Schreiner and Gabor C. Temes, IEEE Press 1997, ISBN 0-7803-1045-4. Known sigma-delta D-A converters of this type have the disadvantage that they are not asympotically stable and, in short, are astable. In this respect, unwanted limit cycles may be generated by the sigma-delta D-A converter when the input signal of the converter is zero, i.e., when the converter is not excited. These limit cycles may possibly assume high amplitudes which are audible as NF amplitude, for example, in modulation pauses of a wanted broadcast signal, or which degrade the signal-to-noise ratio. Further, without an input signal, sigma delta D-A converters generate a “digital noise”, as it is called, i.e., a zero input signal (x(k)=0 for all k>=k₀) is not uniquely imaged on a zero output signal, but on a sequence of output values which waver around the zero position and accordingly generate noise. The reason for this resides in ideal discrete integrators and in the utilized quantizers. The effects mentioned above impair the functionality and usefulness of such D-A converters.

DESCRIPTION OF THE INVENTION, OBJECT, SOLUTION, ADVANTAGES

It is the object of the present invention to provide an improved sigma-delta D-A converter of the type mentioned above which eliminates the above-mentioned disadvantages.

This object is met by a sigma-delta D-A converter of the type mentioned above having the characterizing features of claim 1.

For this purpose, it is provided, according to the invention, that an amount reducer is provided between the second adder and the delay device, which amount reducer leaves the signal x_(n)(k) unchanged when x_(n)(k)=0 and otherwise lowers the amount |x_(n)(k)| of the signal x_(n)(k) by at least the smallest representable numerical unit, wherein the quantization function of the quantizer of the nth stage of the sigma-delta D-A converter is expressed as follows: ${y_{n}(k)} = \left\{ \begin{matrix} {2^{({1 - n})},} & {{{if}\quad {e_{n}(k)}} > 2^{- n}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{n}(k)} \right)} \leq 2^{- n}} \\ {{- 2^{({1 - n})}},} & {{{if}\quad {e_{n}(k)}} < {- 2^{- n}}} \end{matrix} \right.$

where abs( ) is the absolute value function. This has the advantage that the sigma-delta D-A converter according to the invention has an asymptotically stable behavior, i.e., all optional starting values of the integrators of the sigma-delta D-A converter reach the zero state in infinity. Further, the necessary quantity of output stages of the D-A converter is minimized, which reduces expenditure on subsequent circuits.

Preferred further developments of the device are described in claims 2 to 4.

A use signal of the nth stage, where n>1, is advisably the output signal x_(n-1)(k) of the second adder of the (n−1)th stage, wherein the nth stage (n−1) has differentiators following the quantizer when there are two or more stages.

A conclusive combination of the output signals of all stages is achieved in that the first (N−1) stages, where N>1, each have a third adder which follows the quantizer in the case of the first stage and which follows the differentiators in the case of the second to (N−1)th stage, wherein every third adder of the first to (N−2)th stages is connected with the respective third adder of the next highest stage and the third adder of the (N−1)th stage is connected with the last differentiator of the Nth stage.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described more fully in the following with reference to the accompanying drawings.

FIG. 1 shows a first preferred embodiment form of a sigma-delta D-A converter according to the invention;

FIG. 2 shows a second preferred embodiment form of a sigma-delta D-A converter according to the invention;

FIG. 3 shows a third preferred embodiment form of a sigma-delta D-A converter according to the invention.

BEST MODE FOR CARRYING OUT THE INVENTION

The first preferred embodiment form of a sigma-delta D-A converter 100 according to the invention shown in FIG. 1 is a single-stage type (N=1) and comprises a first adder 10 which receives a use signal x(k) at 12 and, with an error signal err₁(k−1), adds it to an input signal e₁(k) at 10 to form a signal 14. A quantizer 16 following the adder 10 quantizes the input signal e₁(k) according to a predetermined quantization function to form an output signal y₁(k) at 18. A second adder 20 adds the input signal e₁(k) with the inverted output signal y₁(k) to x₁(k) at 21 and supplies it to a delay device 22 which sends the signal x₁(k) to the first adder 10 with a delay by a clock period as the error signal err₁(k−1).

An amount reducer 24 which leaves the signal x₁(k) unchanged when x₁(k)=0 and otherwise reduces the absolute value |x₁(k)| of the signal x₁(k) by at least the smallest representable numerical unit is provided between the second adder 20 and the delay device 22. A corresponding output signal z₁(k) of the amount reducer 24 is at 26 and forms the input signal for the delay device 22. The quantization function q₁(e₁(k)) of the quantizer of this individual stage of the sigma-delta D-A converter is expressed according to the invention as follows: ${y_{1}(k)} = \left\{ \begin{matrix} {1,} & {{{if}\quad {e_{1}(k)}} > {1/2}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{1}(k)} \right)} \leq {1/2}} \\ {{- 1},} & {{{if}\quad {e_{1}(k)}} < {{- 1}/2}} \end{matrix} \right.$

In this case, k=1, 2, 3, . . . etc. designates the kth sampling value and is accordingly equivalent to a discrete time. At a sampling frequency f_(a), a time or period duration T between two sampling processes is given by T=1/f_(a). Accordingly, the kth sampling value corresponds to a previous time t(k)=k*T.

The second preferred embodiment form of a sigma-delta D-A converter 200 according to the invention which is shown in FIG. 2 is a two-stage type (N=2) in which two stages of the type according to FIG. 1 are combined in such a way that the output x₁(k) of the second adder 20 of the first stage serves as an input signal for the first adder 10 of the second stage. Further, the quantizer 16 of the second stage is followed by a digital differentiator 28 whose output is fed to an input of an additional, third adder 30 of the first stage so that the output signal y(k) results at 32. All identical parts in the respective stages are designated by the same reference numbers and reference is had to the preceding remarks pertaining to FIG. 1 for explanation. Further, the respective index n of the input signal e_(n)(k) at 14, output signal y_(n)(k) at 18, signal x_(n)(k) at 21 and z_(n)(k) at 26 is increased by one for the second stage, so that signals e₂(k), y₂(k), x₂(k) and z₂(k) are given at the indicated locations in the second stage.

The quantization function q₁(e₁(k)) of the first stage corresponds to those according to the first preferred embodiment form 100 according to FIG. 1. The quantization function q₂(e₂(k)) of the second stage is expressed as follows: ${y_{2}(k)} = \left\{ \begin{matrix} {{1/2},} & {{{if}\quad {e_{2}(k)}} > {1/4}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{2}(k)} \right)} \leq {1/4}} \\ {{{- 1}/2},} & {{{if}\quad {e_{2}(k)}} < {{- 1}/4}} \end{matrix} \right.$

In the third preferred embodiment form of a sigma-delta D-A converter 300 according to the invention, a third stage having two differentiators 28 is provided (N=3), analogous to the second embodiment form 200. All identical parts in the respective stages are designated by the same reference numbers and reference is had to the preceding remarks pertaining to FIGS. 1 and 2 for explanation. The corresponding signals e₃(k), y₃(k), x₃(k) and z₃(k) of the third stage are at locations 14, 18, 21 and 26. The respective output signals y₁(k), y₂(k) and y₃(k) are again added via the third adder 30 of the respective stages to the output signal y(k) at 32.

The quantization functions q₁(e₁(k)) and q₂(e₂(k)) of the first and second stages correspond to the quantization function of the first and second stage according to the second embodiment form 200 of FIG. 2. The quantization function q₃(e₃(k)) of the third stage is expressed as follows: ${y_{3}(k)} = \left\{ \begin{matrix} {{1/4},} & {{{if}\quad {e_{3}(k)}} > {1/8}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{3}(k)} \right)} \leq {1/8}} \\ {{{- 1}/4},} & {{{if}\quad {e_{3}(k)}} < {{- 1}/8}} \end{matrix} \right.$

For an embodiment form with n stages, where n=1, 2, 3, . . . N, the respective quantization function q_(n)(e_(n)(k)) of the nth stage is expressed as follows: ${y_{n}(k)} = \left\{ \begin{matrix} {2^{({1 - n})},} & {{{if}\quad {e_{n}(k)}} > 2^{- n}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{n}(k)} \right)} \leq 2^{- n}} \\ {{- 2^{({1 - n})}},} & {{{if}\quad {e_{n}(k)}} < {- 2^{- n}}} \end{matrix} \right.$

with respective signals e_(n)(k), y_(n)(k), x_(n)(k) and z_(n)(k) at 14, 18, 21 and 26 in the nth stage. A respective signal y_(nd)(k) is given at 34 after the final differentiator 28 of the second and each subsequent nth stage.

The amount reducer 24 of the respective stage does not result in a conventional rounding up or rounding down but, rather, always in a reduction of the value of the signal x_(n)(k), unless x_(n)(k)=0. In other words, each amount reducer 24 removes energy from the sigma-delta D-A converter so that it is clear that no limit cycles can come about. However, this will also be illustrated mathematically in the following with reference to the first embodiment form 100 according to FIG. 1.

x(k) is the digital input signal at 12 with a value range between −1 and 1. e₁(k) is the input signal of the quantizer 16. y(k) is the output signal of the single-stage sigma-delta D-A converter 100 at 32. In this case with the single-stage sigma-delta A-D converter, y₁(k)=y(k). Let the input signal x(k) not be equal to zero for the k₀th sampling value and before this, i.e., until time t₀=k₀*T, and let x(k)=0 after time t₀, i.e.: ${x(k)} = \left\{ \begin{matrix} {{x(k)},} & {k < k_{0}} \\ {0,} & {otherwise} \end{matrix} \right.$

This case occurs, for example, in communications systems when t₀ is followed by a modulation pause. At this time t₀, there is a numerical value I0 in the delay device 22 which can be regarded as an initial value or starting value for a time segment in which there is no excitation of the sigma-delta D-A converter. The amount reducer 24 executes the following function: ${z_{1}(k)} = \left\{ \begin{matrix} {{{x_{1}(k)} + {1{LSB}}},} & {{{if}\quad {x_{1}(k)}} < 0} \\ {0,} & {{{if}\quad {x_{1}(k)}} = 0} \\ {{{x_{1}(k)} - {1{LSB}}},} & {{{if}\quad {x_{1}(k)}} > 0} \end{matrix} \right.$

In this case, LSB designates a smallest representable numerical unit. Alternatively, a multiple of LSB can be added or subtracted.

Let I0=vz*b/2^((w−1)) at time t₀, where vz is the sign + or −, b is a numerical value and w is a word length represented in twos complement. For example, with 16 bits, a significance of 15 bits is given, where a bit serves as mathematical sign.

In the first case, let b>2¹⁴, which corresponds to a value in the delay device of I0>½. Then: $\begin{matrix} {{e_{1}(k)} = \quad {B\left\lbrack {{e_{1}\left( {k - 1} \right)} - {y_{1}\left( {k - 1} \right)}} \right\rbrack}} \\ {{= \quad {B\left\lbrack {{e_{1}\left( {k - 1} \right)} - {q_{1}\left( {e_{1}\left( {k - 1} \right)} \right)}} \right\rbrack}},} \end{matrix}$

where B is the amount reducing function of the amount reducer 24 and q₁ is the quantization function of the quantizer 16. Further, under the assumption and by putting in $\begin{matrix} {{e_{1}(0)} =} & {{{I0} = {{b/2^{15}} > {1/2}}},} & \quad \\ {{e_{1}(1)} =} & {{B\left\lbrack {{b/2^{15}} - {2^{15}/2^{15}}} \right\rbrack},} & {{{e_{1}(0)} > {1/2}} = {{> {q\left( {e_{1}(0)} \right)}} = 1}} \\  = & {{B\left\lbrack {\left( {b - 2^{15}} \right)/2^{15}} \right\rbrack},} & {{\left( {b - 2^{15}} \right)/2^{15}} < 0} \\  = & {\left( {b + 1 - 2^{15}} \right)/2^{15}} & \quad \end{matrix}$ Let  0 > e₁(1) > −1/2 $\begin{matrix} {{e_{2}(2)} =} & {{B\left\lbrack {{e_{1}(1)} - {q\left( {e_{1}(1)} \right)}} \right\rbrack},} & {{q\left( {e_{1}(1)} \right)} = 0} \\  = & {B\left\lbrack {e_{1}(1)} \right\rbrack} & \quad \\  = & {\left( {b + 2 - 2^{15}} \right)/2^{15}} & \quad \end{matrix}$

gives, generally, ${e_{1}(k)} = \left\{ \begin{matrix} {\frac{\left( {b + k - 2^{15}} \right)}{2^{15}},} & {{{{if}\quad b} + k} < 2^{15}} \\ {0,} & {otherwise} \end{matrix} \right.$

The following is given for the output sequence y₁(k): ${y_{1}(k)} = \left\{ \begin{matrix} {1,} & {{{if}\quad k} = 0} \\ {0,} & {otherwise} \end{matrix} \right.$

In the second case, let 0<b<2¹⁴. Analogously, this gives: ${e_{1}(k)} = \left\{ \begin{matrix} {\frac{\left( {b - k} \right)}{2^{15}},} & {{{{if}\quad b} - k} > 0} \\ {0,} & {otherwise} \end{matrix} \right.$

and y₁(k)=0 for all k. The third case where 2¹⁴<b<0 is proven in a manner analogous to the second case, and the fourth case where b<−2¹⁴ is proven analogously to the first case.

In the single-stage case in question, as well as in the embodiment forms 200 and 300 with a plurality of stages, the first stage of the sigma-delta D-A converter supplies the signal e₁(k)=0 in the absence of excitation, i.e., input signal x(k) equals zero, after an infinite time. In the worst case, this time can be estimated as follows:

t _(max)=(½*2^((w−1))+1)*T, where T=1/f _(a) ,f _(a) sampling frequency.

After this maximum time, signal e₁(k)=0 and, therefore, the output signal of the second adder 20 x₁(k) likewise equals 0. The second stage works analogous to the first stage and after infinite time delivers output signal y₂(k)=0. This principle can be expanded in an obvious manner to n-stage sigma-delta D-A converters.

Further, through selection of the quantizer, according to the invention, of the respective stages, there is a reduction in the range of values of the output signal y(k), which will be explained in more detail in the following with reference to the two-stage sigma-delta D-A converter 200 according to FIG. 2.

The signal y₁(k) after the quantizer 16 of the first stage has possible values 1, 0, −1. The signal y₂(k) after the quantizer 16 of the second stage has possible values ½, 0, −½. After the differentiator 28 in the second stage, possible values 1, ½, 0, −½, −1 are given for y₂d(k). Therefore, signal y(k) after the third adder 30 of the first stage has possible values

2, 1½, 1, ½, 0, −½, −1, −1½, −2

However, values 2 and −2 do not exist at output 32 as can be shown by contradiction:

Assume y(k)=2

y(k)=2

<=>y ₁(k)=1 and y ₂ d(k)=1

<=>y ₁(k)=1 and y ₂(k)=½and y ₂(k−1)=−½

<=>e ₁(k)>½ and e ₂(k)>¼ and e ₂(k−1)<−¼

Further, when q₁, q₂, . . . q_(n) equals the respective quantization function of the 1 st, 2nd,. . . nth stage: $\begin{matrix} {{e_{2}(k)} = \quad {{e_{2}\left( {k - 1} \right)} - {q_{2}\left( {e_{2}\left( {k - 1} \right)} \right)} + \left( {{e_{1}(k)} - {q_{1}\left( {e_{1}(k)} \right)}} \right)}} \\ {{= \quad {{- \frac{1}{4}} - {eps}_{1} - \left( {- \frac{1}{2}} \right) + \left( {\frac{1}{2} + {eps}_{2} - 1} \right)}},} \\ {\quad {{{where}\quad {eps}_{1}},{{eps}_{2} > 0}}} \\ {= \quad {{eps}_{2} - {eps}_{1} - \frac{1}{4}}} \end{matrix}$ $\begin{matrix} \left. \Leftrightarrow{\frac{1}{4} + {eps}_{3}} \right. & = & {{{eps}_{2} - {eps}_{1} - \frac{1}{4}}\quad,\quad {{{where}\quad {eps}_{3}} > 0}} \\ \left. \Leftrightarrow\frac{1}{2} \right. & = & {{eps}_{2} - {eps}_{1} - \quad {eps}_{3}} \end{matrix}$

However, this is a contradiction, since eps₂<=½ and eps₁, eps₃>0. By analogy, y(k)=−2 is impossible.

The following possible range of values of the output signal y(k) at 32 is given for the third preferred embodiment form of a sigma-delta D-A converter 300, according to the invention in FIG. 3:

Signal y₁(k) has possible values 1, 0, −1.

Signal y₂(k) has possible values ½, 0, −½.

Signal y₃(k) has possible values ¼, 0, −¼.

After the differentiator 28 of the second stage, y_(2d)(k) has possible values

1, ½, 0, ½, −1.

After the second differentiator 28 of the third stage, y_(3d)(k) has possible values

1, ¾, ½, ¼, 0, −¼, −½, −¾, −1.

Signal y(k) therefore has the following theoretical range of values at 32:

3, 2.75, 2.5, 2.25, 2, 1.75, 1.5, 1.25, 1, 0.75, 0.5, 0.25, 0, −0.25, −0.5, −0.75, −1, −1.25, −1.5, −1.75, −2, −2.25, −2.5, −2.75, −3.

Of these 25 states, only the following 15 states occur:

1.75, 1.5, 1.25, 1, 0.75, 0.5, 0.5, 0.25, 0, −0.25, −0.5, −0.75, −1, −1.25, −1.5, −1.75,

which can be proven again by analogous contradiction as before.

In conclusion, a sigma-delta D-A converter is given according to the invention with asymptotically stable behavior, for example, with three stages (FIG. 3), in which no limit cycles exist and which forms an input signal zero in infinity on an output signal zero, so that noise is minimized during those times in which the sigma-delta D-A converter is not excited. Through specific selection of the quantization function q_(n)(e_(n)(k), the three-stage sigma-delta D-A converter 300 according to FIG. 3 requires, for example, only 15 output stages so that a corresponding expenditure on subsequent circuits, for example, a resistance network or corresponding current pumps, is considerably reduced even with long word lengths w of 32 bits, for example. 

What is claimed is:
 1. Sigma-delta D-A converter (100, 200, 300) with N stages, in which the nth stage, where n=1, 2, 3 . . . N, comprises a first adder (10) which adds a use signal x(k) (12) with an error signal err_(n)(k−1) to an input signal e_(n)(k) (14), a quantizer (16) which quantizes the input signal e_(n)(k) (14) to an output signal y_(n)(k) (18) according to a predetermined quantization function, and a second adder (20) which adds the input signal e_(n)(k) (14) with the inverted output signal y_(n)(k) to x_(n)(k) (21), and supplies it to a delay device (22) which sends the signal x_(n)(k) (21) to the first adder (10) as an error signal err_(n)(k−1) with a delay by a clock period, characterized in that an amount reducer (24) is provided between the second adder (20) and the delay device (22), which amount reducer (24) leaves the signal x_(n)(k) (21) unchanged when x_(n)(k)=0 and otherwise lowers the amount |x_(n)(k)| of the signal x_(n)(k) (21) by at least a smallest representable numerical unit, wherein the quantization function of the quantizer (16) of the nth stage of the sigma-delta D-A converter (100, 200, 300) is expressed as follows: ${y_{n}(k)} = \left\{ \begin{matrix} {2^{({1 - n})},} & {{{if}\quad {e_{n}(k)}} > 2^{- n}} \\ {0,} & {{{if}\quad {abs}\quad \left( {e_{n}(k)} \right)} \leq 2^{- n}} \\ {{- 2^{({1 - n})}},} & {{{if}\quad {e_{n}(k)}} < {- {2^{- n}.}}} \end{matrix} \right.$


2. Sigma-delta D-A converter (200, 300) according to claim 1, characterized in that a use signal of the nth stage, where n>1, is the output signal x_(n-1)(k) (21) of the second adder (20) of the (n−1)th stage.
 3. Sigma-delta D-A converter (200, 300) according to claim 1, characterized in that the nth stage (n−1) has differentiators (28) following the quantizer (16).
 4. Sigma-delta D-A converter (200, 300) according to claim 1, characterized in that the first (N−1) stages, where N>1, each have a third adder (30) which follows the quantizer (16) in the case of the first stage and which follows the differentiators (28) in the case of the second to (N−1)th stage, wherein every third adder (30) of the first to (N−2)th stages is connected with the respective third adder (30) of the next highest stage and the third adder (30) of the (N−1)th stage is connected with the last differentiator (28) of the Nth stage. 